Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(s(0),g(x)) |
→ f(x,g(x)) |
| 2: |
|
g(s(x)) |
→ g(x) |
|
There are 2 dependency pairs:
|
| 3: |
|
F(s(0),g(x)) |
→ F(x,g(x)) |
| 4: |
|
G(s(x)) |
→ G(x) |
|
The approximated dependency graph contains 2 SCCs:
{3}
and {4}.
-
Consider the SCC {3}.
The usable rules are {2}.
The constraints could not be solved.
-
Consider the SCC {4}.
There are no usable rules.
By taking the AF π with
π(G) = 1 together with
the lexicographic path order with
empty precedence,
rule 4
is strictly decreasing.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006